Maurer-Yacobi ID-Based Key Distribution Revisited

In 1984, Shamir first introduced the concept of ID-based cryptosystems [1]. Although various schemes have been proposed after his proposal, we may say that the only bilinear map based schemes [2], [3] are practical. In this letter, we examine the realizability of the other scheme: Maurer-Yacobi key distribution scheme [4]. In this scheme, a user’s private key is generated by solving Discrete Logarithm Problem (DLP). Boneh and Franklin criticize in [3] that this scheme “requires the Private Key Generator (PKG) to spend a long time for each private key generation request.” First, we show the requirement so that MaurerYacobi scheme is regarded as a practical scheme. Then, we propose an adequate parameter setting so as to meet the requirement. We evaluate the computational time for key generation under such parameter setting and describe that key generation is feasible in a practical time. Our results show that Maurer-Yacobi scheme is more practical than previously expected and can be practical in the near future under adequate parameter setting and correct usage.